Intuitionisitic Tableau Extracted
نویسنده
چکیده
This paper presents a formalization of a sequent presentation of intuitionisitic propositional logic and proof of decidability. The proof is implemented in the Nuprl system and the resulting proof object yields a “correct-by-construction” program for deciding intuitionisitc propositional sequents. The extracted program turns out to be an implementation of the tableau algorithm. If the argument to the resulting decision procedure is a valid sequent, a formal proof of that fact is returned, otherwise a counter-example in the form of a Kripke Countermodel is returned. The formalization roughly follows Aitken, Constable and Underwood’s presentation in [1] but a number of adjustments and corrections have been made to ensure the extracted program is clean (no non-computational junk) and efficient.
منابع مشابه
Finding Intrinsic and Extrinsic Viewing Parameters from a Single Realist Painting
In this paper we studied the geometry of a three-dimensional tableau from a single realist painting – Scott Fraser’s Three way vanitas (2006). The tableau contains a carefully chosen complex arrangement of objects including a moth, egg, cup, and strand of string, glass of water, bone, and hand mirror. Each of the three plane mirrors presents a different view of the tableau from a virtual camera...
متن کاملIntuitionisitic Fuzzy B-algebras
In 1966, (Imai and Iseki, 1966) defined a class of algebras of type (2, 0) named BCK-algebras. At the same time, (Iseki, 1966) generalized another class of algebras of type (2, 0) called BCI-algebras. Hu and Li (1983) introduced the concept of BCH-algebras and gave examples of proper BCH-algebras (Hu and Li, 1985). Neggers and Kim (2001) introduced and investigated a class of algebras, viz., th...
متن کاملCombinatorics of Tableau Inversions
A tableau inversion is a pair of entries in row-standard tableau T that lie in the same column of T yet lack the appropriate relative ordering to make T columnstandard. An i-inverted Young tableau is a row-standard tableau along with precisely i inversion pairs. Tableau inversions were originally introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, with the number o...
متن کاملMatrix Tableau-pairs with Key and Shuffling Conditions
It has been shown that the sequence of Smith invariants defined by certain sequences of products of matrices, with entries in a local principal ideal domain, are combinatorially described by tableau-pairs (T, K) where T is a tableau of skew-shape which rectifies to the key-tableau K. It is a fact that the set of all shuffles of the columns of a key-tableau is a subset of its Knuth class. Here, ...
متن کاملTerminating tableau calculi for modal logic K with global counting operators
This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the second is a refinement that internalises the semantics of the logic without using nominals. We prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999